Mathematical Model of the Single Transferable Vote Election
نویسندگان
چکیده
The Single Transferable Vote (STV) is a voting system used in some parts of Britain and Australia today. We model the voting system by randomly generating N candidates over [0,1], and assigning areas closest to them. As N increases, the probability that the STV election and the plurality election will produce the same result decreases. In single-winner elections candidates at .5 have the highest chance of winning when there are two or three candidates. Candidates around .4 and .6 have the highest chance of winning as the number of candidates increases beyond 4. When the initial area before the first elimination is computed for an STV election, it tends to be lower than the initial area of a plurality election. When multiple winners are introduced, the number of relative maxima corresponds to the number of winners in the election. This is the case with both the STV and plurality election, but the maxima and minima are much more distinct for the STV election. When candidates are placed in multiple dimensions, both elections see the maxima of winners near the center. In the STV election, the difference is more distinct; candidates near the middle have a higher chance of winning, and candidates near the edge have a lower chance of winning.
منابع مشابه
Single Transferable Vote Resists Strategic Voting
We give evidence that Single Tranferable Vote (STV) is computationally resistant to manipulation: It is NP-complete to determine whether there exists a (possibly insincere) preference that will elect a favored candidate, even in an election for a single seat. Thus strategic voting under STV is qualitatively more difficult than under other commonly-used voting schemes. Furthermore, this resistan...
متن کاملManipulability of Single Transferable Vote
For many voting rules, it is NP-hard to compute a successful manipulation. However, NP-hardness only bounds the worst-case complexity. Recent theoretical results suggest that manipulation may often be easy in practice. We study empirically the cost of manipulating the single transferable vote (STV) rule. This was one of the first rules shown to be NP-hard to manipulate. It also appears to be on...
متن کاملMathematical Aspects of Irish Elections
In this paper we will describe the Irish voting system by means of examples from the 2002 general election. We will also discuss the random element of the current counting procedure, the policy of only considering the last received sub-parcel when transferring, and the fact that STV is non-monotonic. Ireland’s electoral system is proportional representation by means of a single transferable vot...
متن کاملTowards Computing Victory Margins in STV Elections
The Single Transferable Vote (STV) is a system of preferential voting employed in multi-seat elections. Each vote cast by a voter is a (potentially partial) ranking over a set of candidates. No techniques currently exist for computing the margin of victory (MOV) in STV elections. The MOV is the smallest number of vote manipulations (changes, additions, and deletions) required to bring about a c...
متن کاملStrategic, sincere, and heuristic voting under four election rules: an experimental study
We report on laboratory experiments on voting. In a setting where subjects have single-peaked preferences, we find that the rational choice theory provides very good predictions of actual individual behavior in one-round and approval voting elections but fares poorly in explaining vote choice under two-round elections. We conclude that voters behave strategically as far as strategic computation...
متن کامل